Chained Declustering: A New Availability Strategy for Multiprocessor Database Machines
نویسندگان
چکیده
This paper presents a new strategy for increasing the availability of data in multi-processor, shared-nothing database machines. This technique, termed chained declustering, is demonstrated to provide superior performance in the event of failures while maintaining a very high degree of data availability. Furthermore, unlike most earlier replication strategies, the implementation of chained declustering requires no special hardware and only minimal modifications to existing software.
منابع مشابه
Chained Declustering: A New Availability Strategy for Multiprocssor Database machines
This paper presents a new strategy for increasing the availability of data in multi-processor, shared-nothing database machines. This technique, termed chained declustering, is demonstrated to provide superior performance in the event of failures while maintaining a very high degree of data availability. Furthermore, unlike most earlier replication strategies, the implementation of chained decl...
متن کاملHybrid-Range Partitioning Skate y: A New Deelustering Strategy for Multiprocessor 8 atabase Machines
In shared-nothing multiprocessor database machines, the relational operators that form a query are executed on the processors where the relations they reference are stored. In general, as the number of processors over which a relation is declustered is increased, the execution time for the query is decreased because more processors are used, each of which has to process fewer tuples. However, f...
متن کاملMulti-Site Declustering Strategies for Very High Database Service Availability
The thesis introduces the concept of multi-site declustering strategies with self repair for databases demanding very high service availability. Existing work on declustering strategies are centered around providing high performance and reliability inside a small geographical area (site). Applications demanding robustness against site failures like fire and power outages, can not use these meth...
متن کاملA Multiuser Performance Analysis of Alternative Declustering Strategies
In shared-nothing multipocessor database machines, the storage organization for a relation is independent of the strategy used to decluster the relation. A database administrator for such a system has a wide range of alternatives when creating a relation. In this paper, we analyze the impact of three alternative declustering strategies on the performance of the selection queries using different...
متن کاملAn Evaluation on Dynamic Access-Skew Balancing Performance of Compound Parallel Btree for Chained Declustering Parallel Systems
Access skew is the most important challenge for scalable parallel systems, especially when data are in range partitioned schema. To realize scalability, many dynamic accesses skew balancing methods with data reorganization and parallel index structures on shared-nothing parallel infrastructure have been proposed. Data migration with range-partitioned placement using a parallel Btree is one solu...
متن کامل